RAQFM: A Resource Allocation Queueing Fairness Measure

نویسندگان

  • David Raz
  • Hanoch Levy
  • Benjamin Avi-Itzhak
چکیده

Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to computer and communication queueing systems. Recent empirical studies show that fairness is highly important to queueing customers in practical scenarios. Despite this importance, queueing theory has devoted very little effort to this subject and an agreed upon measure for evaluating the fairness of queueing systems does not exist. In this work we propose RAQFM, a Resource Allocation Queueing Fairness Measure. The measure is built under the understanding that a widely accepted measure must adhere to the common sense intuition of researchers as well as practitioners and customers, and must also be based on widely accepted principles of social justice. We present the methodology of RAQFM and the principles on which it is based. We discuss its properties, emphasizing the way they appeal to one’s intuition. We provide a methodology by which a wide variety of queueing systems can be analyzed to derive their fairness value.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A resource allocation queueing fairness measure: properties and bounds

Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to computer and communication queueing systems. Recent empirical studies show that fairness is highly important to queueing customers in actual situations. Despite this importance, queueing theory has devoted very little effo...

متن کامل

Fairness Considerations in Multi-Server and Multi-Queue Systems

Multi-server and multi-queue architectures are common mechanisms used in a large variety of applications (call centers, Web services, computer systems). One of the major motivations behind common queue operation strategies is to grant fair service to the jobs (customers). Such systems have been thoroughly studied by Queueing Theory from their performance (delay distribution) perspective. Howeve...

متن کامل

Classes, Priorities and Fairness in Queueing Systems

Customer classification and prioritization are commonly used in many applications to provide queue preferential service. Their influence on queuing systems has been thoroughly studied from the delay distribution perspective. However, the fairness aspects, which are inherent to any preferential system and highly important to customers, have hardly been studied and not been quantified to date. In...

متن کامل

Locality of reference and the use of sojourn time variance for queue fairness ∗

The variance of customer sojourn time is used, either explicitly or implicitly, as an indication of fairness for as long as queueing theory exists. In this work we demonstrate that this quantity has a disadvantage as a fairness measure, since it is not local to the busy period in which it is measured. It therefore may account for customer discrepancies which are not relevant to fairness of sche...

متن کامل

VLSI implementation of a fairness ATM buffer system

This paper presents a VESI implementation of a resource allocation scheme, based on the concept of weighted fair queueing. The design can be used in Asynchronous Transfer Mode (ATM) networks to ensure fairness and robustness. Weighted fair queueing is a scheduling and buffer management scheme that can provide a resource allocation policy and enforcement of this policy. It can be used in network...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004